Dynamical vertex approximation in its parquet implementation: Application to Hubbard nanorings
نویسندگان
چکیده
منابع مشابه
Parquet approximation for the 4x4 Hubbard cluster.
We present a numerical solution of the parquet approximation, a conserving diagrammatic approach which is self-consistent at both the single-particle and the two-particle levels. The fully irreducible vertex is approximated by the bare interaction thus producing the simplest approximation that one can perform with the set of equations involved in the formalism. The method is applied to the Hubb...
متن کاملDynamical vertex approximation for nanoscopic systems.
With an increasing complexity of nanoscopic systems and the modeling thereof, new theoretical tools are needed for a reliable calculation of complex systems with strong electronic correlations. To this end, we propose a new approach based on the recently introduced dynamical vertex approximation. We demonstrate its reliability already on the one-particle vertex (i.e., dynamical mean field theor...
متن کاملParquet Approximation in Large N Matrix Theories
A parquet approximation (generalized ladder diagrams) in matrix models is considered. By means of numerical calculations we demonstrate that in the large N limit the parquet approximation gives an excellent agreement with exact results.
متن کاملA general approach to linguistic approximation and its application in frame of fuzzy logic deduction
This paper deals with one problem that needs to be addressed in the emerging field known under the name computing with perceptions. It is the problem of describing, approximately, a given fuzzy set in natural language. This problem has lately been referred to as the problem of retranslation. An approaches to dealing with the retranslation problem is discussed in the paper, that ...
متن کاملThe Dynamic Vertex Minimum Problem and Its Application to Clustering-Type Approximation Algorithms
The dynamic vertex minimum problem (DVMP) is to maintain the minimum cost edge in a graph that is subject to vertex additions and deletions. DVMP abstracts the clustering operation that is used in the primal-dual approximation scheme of Goemans and Williamson (GW). We present an algorithm for DVMP that immediately leads to the best-known time bounds for the GW approximation algorithm for proble...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review B
سال: 2015
ISSN: 1098-0121,1550-235X
DOI: 10.1103/physrevb.91.115115